Axiomatizations of quasi-polynomial functions on bounded chains
نویسندگان
چکیده
Two emergent properties in aggregation theory are investigated, namely horizontal maxitivity and comonotonic maxitivity (as well as their dual counterparts) which are commonly defined by means of certain functional equations. We completely describe the function classes axiomatized by each of these properties, up to weak versions of monotonicity, in the cases of horizontal maxitivity and minitivity. While studying the classes axiomatized by combinations of these properties, we introduce the concept of quasi-polynomial function which appears as a natural extension of the well-established notion of polynomial function. We give further axiomatizations for this class both in terms of functional equations and natural relaxations of homogeneity and median decomposability. As noteworthy particular cases, we investigate those subclasses of quasi-term functions and quasi-weighted maximum and minimum functions, and provide characterizations accordingly.
منابع مشابه
Quasi-Polynomial Functions on Bounded Chains
Two emergent properties in aggregation theory are investigated, namely horizontal maxitivity and comonotonic maxitivity (as well as their dual counterparts) which are commonly defined by means of certain functional equations. We present complete descriptions of the function classes axiomatized by each of these properties, up to weak versions of monotonicity, in the cases of horizontal maxitivit...
متن کاملRepresentations and Characterizations of Polynomial Functions on Chains
We are interested in representations and characterizations of lattice polynomial functions f : L → L, where L is a given bounded distributive lattice. In a companion paper [4], we investigated certain representations and provided various characterizations of these functions both as solutions of certain functional equations and in terms of necessary and sufficient conditions. In the present pape...
متن کاملPolynomial Functions on Bounded Chains
We are interested in representations and characterizations of lattice polynomial functions f : L → L, where L is a given bounded distributive lattice. In an earlier paper [4, 5], we investigated certain representations and provided various characterizations of these functions both as solutions of certain functional equations and in terms of necessary and sufficient conditions. In the present pa...
متن کاملZero-free regions of partition functions with applications to algorithms and graph limits
Based on a technique of Barvinok [3, 4, 5] and Barvinok and Soberón [6, 7] we identify a class of edge-coloring models whose partition functions do not evaluate to zero on bounded degree graphs. Subsequently we give a quasi-polynomial time approximation scheme for computing these partition functions. As another application we show that the normalised partition functions of these models are cont...
متن کاملQuasi-polynomial Functions over Bounded Distributive Lattices
In [6] the authors introduced the notion of quasi-polynomial function as being a mapping f : Xn → X defined and valued on a bounded chain X and which can be factorized as f(x1, . . . , xn) = p(φ(x1), . . . , φ(xn)), where p is a polynomial function (i.e., a combination of variables and constants using the chain operations ∧ and ∨) and φ is an order-preserving map. In the current paper we study ...
متن کامل